Resource allocation algorithm for light communication grid-based workflows within an SLA context

Service Level Agreements (SLAs) are currently one of the major research topics in Grid Computing. Among many system components for supporting SLA-aware Grid-based workflow, the SLA mapping mechanism receives a prominent position. It is responsible for assigning sub-jobs of the workflow to Grid resources in a way that meets the user’s deadline and minimizes costs. Assuming many different kinds of sub-jobs and resources, the process of mapping a light communication workflow within an SLA context defines an unfamiliar and difficult problem. This paper presents a mapping algorithm, which can cope with this problem. The quality and efficiency of the algorithm is demonstrated through performance measurements.